Information flow decomposition for network coding
نویسندگان
چکیده
منابع مشابه
Flow Synchronization for Network Coding
Network Coding (NC) is a means to improve network performance in various ways. Most evaluations so far were done with simplified assumptions about the application scenario, namely equal data rates and packet sizes for traffic to be encoded. Traffic in real networks, however, does not have this property. Hence, as deterministic and random NC require these properties, flows have to be synchronize...
متن کاملNetwork Coding from a Network Flow Perspective
The algebraic framework introduced in [4] gives an algebraic condition for the feasibility of a set of multicast connections in a network, that is equivalent to the max-flow min-cut condition of [1]. The algebraic condition also checks the validity of a linear coding solution to a given multicast connection problem. We present two alternative formulations of this condition that are closely tied...
متن کاملNetwork information flow
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. Thi...
متن کاملNetwork Information Flow
A formal model for an analysis of an information flow in interconnection networks is presented. It is based on timed process algebra which can express also network properties. The information flow is based on a concept of deducibility on composition. Robustness of systems against network timing attacks is defined. A variety of different security properties which reflect different security requi...
متن کاملWireless Network Information Flow
We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set bound is a product distribution, then we have a complete characterization of the achievable rates for such networks. For linear deterministic finite-field m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2006
ISSN: 0018-9448
DOI: 10.1109/tit.2005.864435